Quantifier elimination via adjunction
نویسنده
چکیده
Sufficient conditions are provided for quantifier elimination to hold in a first-order theory. The conditions have two main purposes: (1) to ensure that satisfaction of existential formulas is reflected by an embedding; and (2) to guarantee the existence of a “minimal" model of the theory extending a model of the universal formulas entailed by the theory. The first goal is obtained by requiring that a theory is ∃-adequate and the second by imposing the existence of an adjunction. Recognizing that, in some cases, a “minimal" model extending another can be obtained by iterating a construction, we also provide conditions that guarantee the existence of a ω-“limit" functor identifying such an extension, when the theories are in ∀2. Examples are provided along the paper. keywords quantifier elimination, model theory, adjunction, ∃-adequate. AMS 2010 classification 03B25, 03C10, 18C10
منابع مشابه
A Roadmap to Decidability
It is well known that quantifier elimination plays a relevant role in proving decidability of theories. Herein the objective is to provide a toolbox that makes easier to establish quantifier elimination in a semantic way, capitalizing on the fact that a 1-model-complete theory with algebraically prime models has quantifier elimination. Iteration and adjunction are identified as important constr...
متن کاملQuantifier Elimination in p-adic Fields
We present a tutorial survey of quantifier-elimination and decision procedures in p-adic :fieIds. The p-adic :fieIds are studied in the (so-called) P,,-formalism of Angus Macintyre, for whieh motivation is provided through a rieh body of analogies with real-closed :fields. Quantifier-elimination and decision procedures are described proceeding via a Cylindrical Algebraic Decomposition of affine...
متن کاملAdjunction, Phases, and Complex Predicates in Japanese
I provide a unified account of a constraint on adjunction observed in three complex predicate constructions in Japanese: (i) restructuring motion verb constructions, (ii) light verb constructions, (iii) infinitives with wasure‘forget’. It is shown that adjunction (i.e. adverbial modification, adjectival modification, and quantifier raising) in the lower projections are impossible in these const...
متن کاملRobust Nonlinear Feedback Design via Quantifier Elimination Theory
In this paper symbolic-computation methods are used to design simple, fixed-structure, robust controllers for nonlinear systems. Design specifications are reduced to logically quantified polynomial inequalities. The quantifier-elimination (QE) software package QEPCAD is used to eliminate quantifiers on state and plant parameters, to obtain regions of admissible controller parameters, and to gua...
متن کاملBetter Answers to Real Questions
We consider existential problems over the reals. Extended quantifier elimination generalizes the concept of regular quantifier elimination by providing in addition answers, which are descriptions of possible assignments for the quantified variables. Implementations of extended quantifier elimination via virtual substitution have been successfully applied to various problems in science and engin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009